RP-DeLP: A weighted defeasible argumentation framework based on a recursive semantics

RP-DeLP: A weighted defeasible argumentation framework based on a recursive semantics

RP-DeLP: A weighted defeasible argumentation framework based on a recursive semantics

RP-DeLP: A weighted defeasible argumentation framework based on a recursive semantics

RP-DeLP: A weighted defeasible argumentation framework based on a recursive semantics

Formalization and logical properties of the Maximal Ideal Recursive Semantics for Weighted Defeasible Logic Programming

Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming framework which combines features from argumentation theory and logic programming, in which defeasible rules are attached with weights expressing their relative belief or preference strength. In P-DeLP a conclusion succeeds if there exists an argument that entails the conclusion and this argument is found to be undefeate...